Hamilton decompositions of complete bipartite graphs with a 3-factor leave
نویسندگان
چکیده
We show that for any 2-factor U of Kn,n with n odd, there exists a hamilton decomposition of Kn,n − E(U) with a 1-factor leave. Settling this last open case now provides necessary and sufficient conditions for a hamilton decomposition of any complete multipartite graph with the edges of any 2-factor removed.
منابع مشابه
Symmetric Hamilton Cycle Decompositions of Complete Graphs Minus a 1-Factor
Let n ≥ 2 be an integer. The complete graph Kn with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that Kn − F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n ≡ 2, 4 mod 8. We also show that the complete bipartite graph Kn,n has a symmetric Hamilton cycle decomposition if and only if n ...
متن کاملHamilton decompositions of line graphs of some bipartite graphs
Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to have Hamilton decomposable line graphs. One consequence is that every bipartite Hamilton decomposable graph G with connectivity κ(G) = 2 has a Hamilton decomposable line graph L(G).
متن کاملHamilton decompositions of complete multipartite graphs with any 2-factor leave
For m ≥ 1 and p ≥ 3, given a set of integers s1, . . . , sq with sj ≥ p + 1 for 1 ≤ j ≤ q and ∑q j=1 sj = mp, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete p-partite graph Km,...,m−E(U), where U is a 2-factor of Km,...,m consisting of q cycles, the jth cycle having length sj . This result is then used to completely solve the problem ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2005